Additive functions on pseudo-polynomial sequences
نویسندگان
چکیده
The present paper deals with functions acting on the digits of an q-ary expansion. In particular let n be a positive integer, then we call
منابع مشابه
The Distribution of Digital Expansions on Polynomial Sequences
The aim of this thesis is to study the distribution of the sum-of-digits function (and similar functions) on polynomial sequences of integers and primes. Bassily and Kátai [2] proved a central limit theorem for the distribution of sequences f(P (n)), n ∈ N, and f(P (p)), p ∈ P, where f(n) is a q-additive function and P (n) an arbitrary polynomial with integer coefficients (and positive leading ...
متن کاملAdditive Bases Arising from Functions in a Hardy Field
A classical additive basis question is Waring’s problem. It has been extended to integer polynomial and non-integer power sequences. In this paper, we will consider a wider class of functions, namely functions from a Hardy field, and show that they are asymptotic bases.
متن کاملON THE JOINT DISTRIBUTION OF q-ADDITIVE FUNCTIONS ON POLYNOMIAL SEQUENCES
The joint distribution of sequences (f`(P`(n)))n∈N, ` = 1, 2, . . . , d and (f`(P`(p)))p∈P respectively, where f` are q`-additive functions and P` polynomials with integer coefficients, is considered. A central limit theorem is proved for a larger class of q` and P` than by Drmota [3]. In particular, the joint limit distribution of the sum-of-digits functions sq1 (n), sq2 (n) is obtained for ar...
متن کاملASYMPTOTIC NORMALITY OF b-ADDITIVE FUNCTIONS ON POLYNOMIAL SEQUENCES IN CANONICAL NUMBER SYSTEMS
We consider b-additive functions f where b is the base of a canonical number system in an algebraic number field. In particular, we show that the asymptotic distribution of f(p(z)) with p a polynomial running through the integers of the algebraic number field is the normal law. This is a generalization of results of Bassily and Katai (for the integer case) and of Gittenberger and Thuswaldner (f...
متن کاملPolynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights
We consider the problem of finding the edges of a hidden weighted graph and their weights by using a certain type of queries as few times as possible, with focusing on two types of queries with additive property. For a set of vertices, the additive query asks the sum of weights of the edges with both ends in the set. For a pair of disjoint sets of vertices, the cross-additive query asks the sum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010